Fair Play Equilibria in Normal Form Games
نویسندگان
چکیده
For a social code of conduct to gain universal acceptance in a society, it would have to satisfy minimum requirements of consistency and procedural justice. The so-called universalizability principle in ethics says that any moral judgement made for an action of a person in a situation should be universalizable to other persons’ actions in situations that are identical in relevant respects. By adapting standard axioms in social choice theory, we formalize this principle in the framework of normal form games and study its implications on equilibrium outcomes. A social code specifies socially acceptable responses against other individuals’ behavior. A fair play equilibrium is an action profile where everyone behaves optimally subject to the social code. We show that for any admissible social code, the set of fair play equilibria coincides with that of Nash equilibria in all games. The result identifies a conflict between the universalizability principle and what a social code can achieve as equilibrium outcomes. JEL Classification: C70, D63, D71
منابع مشابه
A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games
Abstract This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...
متن کاملReaching correlated equilibria through multi-agent learning
Many games have undesirable Nash equilibria. For example consider a resource allocation game in which two players compete for an exclusive access to a single resource. It has three Nash equilibria. The two pure-strategy NE are efficient, but not fair. The one mixed-strategy NE is fair, but not efficient. Aumann’s notion of correlated equilibrium fixes this problem: It assumes a correlation devi...
متن کاملGlobal Newton Method for stochastic games
The Global Newton Method for games in normal form and in extensive form is shown to have a natural extension to computing Markov-perfect equilibria of stochastic games. GLOBAL NEWTON METHOD FOR STOCHASTIC GAMES SRIHARI GOVINDAN AND ROBERT WILSON Abstract. The Global Newton Method for games in normal form and in extensive form is shown to have a natural extension to computing Markov-perfect equi...
متن کاملNash equilibrium and generalized integration for infinite normal form games
Infinite normal form games that are mathematically simple have been treated [ Harris, C.J., Stinchcombe, M.B., Zame, W.R., in press. Nearly compact and continuous normal form games: characterizations and equilibrium existence. Games Econ. Behav.]. Under study in this paper are the other infinite normal form games, a class that includes the normal forms of most extensive form games with infinite...
متن کاملComputing Equilibria for Two-Person Games
This paper is a self-contained survey of algorithms for computing Nash equilibria of two-person games given in normal form or extensive form. The classical Lemke{Howson algorithm for nding one equilibrium of a bimatrix game is presented graph-theoretically as well as algebraically in terms of complementary pivoting. Common deenitions of degenerate games are shown as equivalent. Enumeration of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005